Rare Association Rule Mining via Transaction Clustering
نویسندگان
چکیده
Rare association rule mining has received a great deal of attention in the recent past. In this research, we use transaction clustering as a pre-processing mechanism to generate rare association rules. The basic concept underlying transaction clustering stems from the concept of large items as defined by traditional association rule mining algorithms. We make use of an approach proposed by Koh & Pears (2008) to cluster transactions prior to mining for association rules. We show that pre-processing the dataset by clustering will enable each cluster to express their own associations without interference or contamination from other sub groupings that have different patterns of relationships. Our results show that the rare rules produced by each cluster are more informative than rules found from direct association rule mining on the unpartitioned dataset.
منابع مشابه
Mining the Banking Customer Behavior Using Clustering and Association Rules Methods
The unprecedented growth of competition in the banking technology has raised the importance of retaining current customers and acquires new customers so that is important analyzing Customer behavior, which is base on bank databases. Analyzing bank databases for analyzing customer behavior is difficult since bank databases are multi-dimensional, comprised of monthly account records and daily t...
متن کاملToward boosting distributed association rule mining by data de-clustering
Existing parallel algorithms for association rule mining have a large inter-site communication cost or require a large amount of space to maintain the local support counts of a large number of candidate sets. This study proposes a de-clustering approach for distributed architectures, which eliminates the inter-site communication cost, for most of the influential association rule mining algorith...
متن کاملAn FP-Growth Approach to Mining Association Rules
In the field of data mining researchers implements lots of algorithms for improving the performance of mining. This work is also related to that strategy. This work, introduce an idea in this field. Here use Sampling Technique to convert text document in to the appropriate format. This format contains data in the form of word and topic of word. This format take as a input in FPGrowth algorithm ...
متن کاملFrequent Data Generation Using Relative Data Analysis
Traditional association rule mining method mines association rules only for the items bought by the customer. However an actual transaction consists of the items bought by the customer along with the quantity of items bought. This paper reconsiders the traditional database by taking into account both items as well as its quantity. This new transaction database is named as bag database and each ...
متن کاملClustering Based Multi-Objective Rule Mining using Genetic Algorithm
Multi-Objective Genetic Algorithm (MOGA) is a new approach for association rule mining in the market-basket type databases. Finding the frequent itemsets is the most resource-consuming phase in association rule mining, and always does some extra comparisons against the whole database. This paper proposes a new algorithm, Cluster-Based MultiObjective Genetic Algorithm (CBMOGA) which optimizes th...
متن کامل